Scalable Minimization Algorithm for Partial Bisimulation

Scalable Minimization Algorithm for Partial Bisimulation

We present an efficient algorithm for computing the partial bisimulation preorder and equivalence for labeled transitions systems. The partial bisimulation preorder lies between simulation and bisimulation, as only a part of the set of actions is bisimulated, whereas the rest of the actions are simulated. Computing quotients for simulation equivalence is more expensive than for bisimulation equ...

A Scalable Algorithm for Query Minimization

Algorithm for Minimization of Partial Boolean Functions

The paper presents a minimization algorithm for Boolean functions defined by truth tables. It treats only minterms having defined output values and is thus efficient above all in case of highly undefined functions, where the methods processing also the don't care states lose much time. The algorithm proves its full strength for functions with several hundreds of variables and several hundreds o...

Bisimulation Minimization of Tree Automata

We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of O(r̂ m log n), where r̂ is the maximum rank of the input alphabet, m is the total size of the transition table, and n is th...

Bisimulation Minimization and Symbolic Model Checking

State space minimization techniques are crucial for combating state explosion. A variety of explicitstate verification tools use bisimulation minimization to check equivalence between systems, to minimize components before composition, or to reduce a state space prior to model checking. Experimental results on bisimulation minimization in symbolic model checking contexts, however, are mixed. Th...